A constraint satisfaction approach to testbed embedding services
نویسندگان
چکیده
منابع مشابه
A Game-Theoretic Approach to Constraint Satisfaction
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for constraint satisfaction are intimately related to certain combinatorial pebble games, called the existential k-pebble games, that were originally introduced in the context of Datalog. The crucial insight relating pebble ga...
متن کاملA Constraint Satisfaction Approach to Machine Translation
Constraint satisfaction inference is presented as a generic, theory-neutral inference engine for machine translation. The approach enables the integration of many different solutions to aspects of the output space, including classification-based translation models that take source-side context into account, as well as stochastic components such as target language models. The approach is contras...
متن کاملA Constraint Satisfaction Approach to Dependency Parsing
We present an adaptation of constraint satisfaction inference (Canisius et al., 2006b) for predicting dependency trees. Three different classifiers are trained to predict weighted soft-constraints on parts of the complex output. From these constraints, a standard weighted constraint satisfaction problem can be formed, the solution to which is a valid dependency tree.
متن کاملA Constraint Satisfaction Approach to Geospatial Reasoning
The large number of data sources on the Internet can be used to augment and verify the accuracy of geospatial sources, such as gazetteers and annotated satellite imagery. Data sources such as satellite imagery, maps, gazetteers and vector data have been traditionally used in geographic information systems (GIS), but nontraditional geospatial data, such as online phone books and property records...
متن کاملA Constraint Satisfaction Approach to Makespan Scheduling
In this paper, we consider the application a constraint satisfaction problem solving (CSP) framework recently developed for deadline scheduling to more commonly studied problems of schedule optimization. Our hypothesis is two-fold: (1) that CSP scheduling techniques can provide a basis for developing highperformance approximate solution procedures in optimization contexts, and (2) that the repr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGCOMM Computer Communication Review
سال: 2004
ISSN: 0146-4833
DOI: 10.1145/972374.972398